RAPPID: An Asynchronous Instruction Length Decoder
نویسندگان
چکیده
This paper describes an investigation of potential advantages and risks of applying an aggressive asynchronous design methodology to Intel Architecture. RAPPID (“Revolving Asynchronous Pentium® Processor Instruction Decoder”), a prototype IA32 instruction length decoding and steering unit, was implemented using self-timed techniques. RAPPID chip was fabricated on a 0.25μ CMOS process and tested successfully. Results show significant advantages—in particular, performance of 2.5-4.5 instructions/nS—with manageable risks using this design technology. RAPPID achieves three times the throughput and half the latency, dissipating only half the power and requiring about the same area as an existing 400MHz clocked circuit.
منابع مشابه
CA-BIST for Asynchronous Circuits: A Case Study on the RAPPID Asynchronous Instruction Length Decoder
This paper presents a case study in low-cost noninvasive Built-In Self Test (BIST) for RAPPID, a largescale 120,000-transistor asynchronous version of the Pentium R Pro Instruction Length Decoder, which runs at 3.6 GHz. RAPPID uses a synchronous 0.25 micron CMOS library for static and domino logic, and has no Design-for-Test hooks other than some debug features. We explore the use of Cellular A...
متن کاملAn Asynchronous Instruction Length Decoder
This paper describes an investigation of potential advantages and pitfalls of applying an asynchronous design methodology to an advanced microprocessor architecture. A prototype complex instruction set length decoding and steering unit was implemented using self-timed circuits. [The Revolving Asynchronous Pentium® Processor Instruction Decoder (RAPPID) design implemented the complete Pentium II...
متن کاملPerformance Analysis of Asynchronous Circuits and Systems using Stochastic Timed Petri Nets
This paper describes and extends a recently developed approach for performance analysis of asynchronous circuits modeled with stochastic timed Petri nets (STPNs) with unique-and free-choice places and arbitrary delay distributions. The approach analyzes nite STPN executions to derive closed-form expressions for lower and upper bounds on the performance estimates that can be eeciently evaluated ...
متن کاملBounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choice
This paper presents a technique to estimate the average time separation of events (TSE) in stochas-tic timed Petri nets that can model time-independent choice and have arbitrary delay distributions associated with places. The approach analyzes nite net unfold-ings to derive closed-form expressions for lower and upper bounds on the average TSE, which can be ef-ciently evaluated using standard st...
متن کاملBounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choicey
This paper presents a technique to estimate the average time separation of events (TSE) in stochastic timed Petri nets that can model time-independent choice and have arbitrary delay distributions associated with places. The approach analyzes nite net unfoldings to derive closed-form expressions for lower and upper bounds on the average TSE, which can be eeciently evaluated using standard stati...
متن کامل